Necessary and sufficient conditions for a compact convex set to be a set of best approximations
نویسندگان
چکیده
منابع مشابه
Necessary and sufficient conditions for a sum-free set of positive integers to be ultimately periodic
Cameron has introduced a natural bijection between the set of one way infinite binary sequences and the set of sum-free sets (of positive integers), and observed that a sum-free set is ultimately periodic only if the corresponding binary sequence is ultimately periodic. He asked if the converse also holds. In this paper we present necessary and sufficient conditions for a sum-free set to be ult...
متن کاملA Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision Author(s):
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. The Econometric Society is collaborating with JSTOR to dig...
متن کاملGlobal Maximum of a Convex Function: Necessary and Sufficient Conditions
In this note we prove that an extended-real-valued lower semi-continuous convex function Φ defined on a reflexive Banach space X achieves its supremum on every nonempty bounded and closed convex set of its effective domain Dom Φ, if and only if the restriction of Φ to Dom Φ is sequentially continuous with respect to the weak topology on the underlying space X .
متن کاملNecessary and Sufficient Conditions for Unit Graphs to Be Hamiltonian
A graph is Hamiltonian if it has a cycle that visits every vertex exactly once; such a cycle is called a Hamiltonian cycle. In general, the problem of finding a Hamiltonian cycle in a given graph is an NP-complete problem and a special case of the traveling salesman problem. It is a problem in combinatorial optimization studied in operations research and theoretical computer science; see [Garey...
متن کاملInference for best linear approximations to set identified functions
This paper provides inference methods for best linear approximations to functions which are known to lie within a band. It extends the partial identification literature by allowing the upper and lower functions defining the band to be any functions, including ones carrying an index, which can be estimated parametrically or non-parametrically. The identification region of the parameters of the b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Approximation Theory
سال: 1970
ISSN: 0021-9045
DOI: 10.1016/0021-9045(70)90026-2